Linear‐time algorithms for eliminating claws in graphs

Vertex-disjoint t-claws in graphs

Let δ(G) denote the minimum degree of a graph G. We prove that for t ≥ 4 and k ≥ 2, a graph G of order at least (t + 1)k + 11 6 t 2 with δ(G) ≥ k + t − 1 contains k pairwise vertex-disjoint copies of K1,t.

Distance-regular graphs without 4-claws

We determine the distance-regular graphs with diameter at least 3 and c2 ≥ 2 but without induced K1,4-subgraphs.

0 Quantum Algorithms for Finding Claws , Collisions and Triangles ∗

We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Høyer, and Tapp, and imply an N3/4 logN quantum upper bound for the element distinctness problem (contrasting with N logN classical complexity). We also give an algorithm to finding a triangle in a graph more efficient...

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

Qualitative Systems Identi ation for LinearTime Invariant